Graph-set analysis of hydrogen-bond patterns: some mathematical concepts.
نویسندگان
چکیده
To provide a foundation for further theoretical and software development of the application of graph sets to patterns of hydrogen bonding and other intermolecular interactions a number of mathematical concepts and tools are defined, developed and demonstrated. Following a review of the basic definitions and uses of graph sets, the directional properties of hydrogen bonds are now included in the treatment. The concepts of a constructor graph and covalent distance matrix have been developed to aid in the generation of a qualitative descriptor for the straightforward, consistent and ultimately automatic (with appropriate software) definition of patterns. An additional mathematical tool, the arrowed T-labeling, has been developed to deal with situations in which pattern-forming moieties are located on crystallographic special positions. To demonstrate the utility and various features of these concepts they are applied in detail to two particular structures, polymorphic iminodiacetic acid [N-(carboxymethyl)glycine] and trans-tetraamminedinitrocobalt(III) acetate. To facilitate the application and use of graph sets many of these developments have already been incorporated into the software of the Cambridge Structural Database, as described in the accompanying paper.
منابع مشابه
The Structure and Chemical Bond of FOX-7: The AIM Analysis and Vibrational Normal Modes
FOX-7 (1,1-diamino-2,2-dinitroethylene) recently is expected as a relatively new energetic material with high-performance and low sensitivity. The RHF and MP2 levels and DFT method with B3LYP functional with aug-cc-pVDZ basis set have been used for obtaining equilibrium geometry and Rho function (electron density distribution). By the aid of fundamental physical theorems implemented in the ...
متن کاملOn Second Atom-Bond Connectivity Index
The atom-bond connectivity index of graph is a topological index proposed by Estrada et al. as ABC (G) uvE (G ) (du dv 2) / dudv , where the summation goes over all edges of G, du and dv are the degrees of the terminal vertices u and v of edge uv. In the present paper, some upper bounds for the second type of atom-bond connectivity index are computed.
متن کاملm-polar intuitionistic graphs and its properties
In many real world problems, data sometimes comes from n agents (n≥2), multipolar information exists. For issues that are associated with uncertainty, this information can not be showed with the values of crisp, fuzzy, intuitionistic or bipolar. Graph is one of the mathematical models widely used in different sciences. Ambiguity in a graph where data depends on the n parameter can not be showed...
متن کاملCharacterization of projective special linear groups in dimension three by their orders and degree patterns
The prime graph $Gamma(G)$ of a group $G$ is a graph with vertex set $pi(G)$, the set of primes dividing the order of $G$, and two distinct vertices $p$ and $q$ are adjacent by an edge written $psim q$ if there is an element in $G$ of order $pq$. Let $pi(G)={p_{1},p_{2},...,p_{k}}$. For $pinpi(G)$, set $deg(p):=|{q inpi(G)| psim q}|$, which is called the degree of $p$. We also set $D(G):...
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Acta crystallographica. Section B, Structural science
دوره 56 (Pt 1) شماره
صفحات -
تاریخ انتشار 1999